On Turán-good graphs
نویسندگان
چکیده
For graphs H and F, the generalized Turán number ex(n,H,F) is largest of copies in an F-free graph on n vertices. We say that F-Turán-good if (χ(F)−1)-partite graph, provided large enough. present a general theorem case F has edge whose deletion decreases chromatic number. In particular, this determines ex(n,Pk,C2ℓ+1) ex(n,C2k,C2ℓ+1) exactly, also study when vertex
منابع مشابه
On the Turán Properties of Infinite Graphs
Let G(∞) be an infinite graph with the vertex set corresponding to the set of positive integers N. Denote by G(l) a subgraph of G(∞) which is spanned by the vertices {1, . . . , l}. As a possible extension of Turán’s theorem to infinite graphs, in this paper we will examine how large lim inf l→∞ |E(G(l))| l2 can be for an infinite graph G(∞), which does not contain an increasing path Ik with k ...
متن کاملTurán Problems for Bipartite Graphs ∗
We consider an infinite version of the bipartite Turán problem. Let G be an infinite graph with V (G) = N, and let Gn be the n-vertex subgraph of G induced by the vertices {1, 2, . . . , n}. We show that if G is K2,t+1-free, then for infinitely many n, e(Gn) ≤ 0.471 √ tn3/2. Using the K2,t+1-free graphs constructed by Füredi, we construct an infinite K2,t+1-free graph with e(Gn) ≥ 0.23 √ tn3/2 ...
متن کاملTurán Numbers of Subdivided Graphs
Given a positive integer n and a graph F , the Turán number ex(n, F ) is the maximum number of edges in an n-vertex simple graph that does not contain F as a subgraph. Let H be a graph and p a positive even integer. Let H(p) denote the graph obtained from H by subdividing each of its edges p−1 times. We prove that ex(n,H(p)) = O(n1+(16/p)). This follows from a more general result that we establ...
متن کاملThe Turán Theorem for Random Graphs
The aim of this paper is to prove a Turán type theorem for random graphs. For 0 < γ ≤ 1 and graphs G and H, write G→γ H if any γ-proportion of the edges of G spans at least one copy of H in G. We show that for every l ≥ 2 and every fixed real 1/(l − 1) > δ > 0 almost every graph G in the binomial random graph model G(n, q), with q = q(n) ((logn)4/n)1/(l−1), satisfies G→(l−2)/(l−1)+δ Kl, where K...
متن کاملA Turán Theorem for Random Graphs Dean of the Graduate School Date a Turán Theorem for Random Graphs a Turán Theorem for Random Graphs
of a thesis submitted to the Faculty of the Graduate School of Emory University in partial fulfillment of the requirements of the degree of Master of Science Department of Mathematics and Computer Science
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112445